On Timed Automata with Input-Determined Guards
نویسندگان
چکیده
We consider a general notion of timed automata with inputdetermined guards and show that they admit a robust logical framework along the lines of [6], in terms of a monadic second order logic characterisation and an expressively complete timed temporal logic. We then generalise these automata using the notion of recursive operators introduced by Henzinger, Raskin, and Schobbens [9], and show that they admit a similar logical framework. These results hold in the “pointwise” semantics. We finally use this framework to show that the real-time logic MITL of Alur et al [2] is expressively complete with respect to an MSO corresponding to an appropriate input-determined operator.
منابع مشابه
On Continuous Timed Automata with Input-Determined Guards
We consider a general class of timed automata parameterized by a set of “input-determined” operators, in a continuous time setting. We show that for any such set of operators, we have a monadic second order logic characterization of the class of timed languages accepted by the corresponding class of automata. Further, we consider natural timed temporal logics based on these operators, and show ...
متن کاملDeterministic Timed Finite State Machines: Equivalence Checking and Expressive Power
There has been a growing interest in defining models of automata enriched with time. For instance, timed automata were introduced as automata extended with clocks. In this paper, we study models of timed finite state machines (TFSMs), i.e., FSMs enriched with time, which accept timed input words and generate timed output words. Here we discuss some models of TFSMs with a single clock: TFSMs wit...
متن کاملStatic Guard Analysis in Timed Automata Verification
By definition Timed Automata have an infinite state-space, thus for verification purposes, an exact finite abstraction is required. We propose a locationbased finite zone abstraction, which computes an abstraction based on the relevant guards for a particular state of the model (as opposed to all guards). We show that the location-based zone abstraction is sound and complete with respect to loc...
متن کاملForward Analysis of Timed Automata
Timed automata constitute a well adapted model for real-time aspects. However, a classical forward analysis algorithm used to verify safety properties has been showed to be incorrect in the general framework of timed automata. Nevertheless, it is correct when we restrict the class to timed automata with only non-diagonal guards. The aim of this work is to understand the role of diagonal guards ...
متن کاملParameterized Model-Checking of Timed Systems with Conjunctive Guards
In this work we extend the Emerson and Kahlon’s cutoff theorems for process skeletons with conjunctive guards to Parameterized Networks of Timed Automata, i.e. systems obtained by an apriori unknown number of Timed Automata instantiated from a finite set U1, . . . , Un of Timed Automata templates. In this way we aim at giving a tool to universally verify software systems where an unknown number...
متن کامل